Irreducible decomposition of binomial ideals
نویسندگان
چکیده
منابع مشابه
Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals
It is known that algorithms exist which compute primary decompositions of polynomial ideals (Gianni et al., 1988; Eisenbud et al., 1992; Becker and Weispfenning, 1993; and more recently Shimoyama and Yokoyama, 1996). However, in case the ideal is binomial, binomiality of its primary components is not assured, that is, the above algorithms do not necessarily compute a decomposition into binomial...
متن کاملComputing Irreducible Decomposition of Monomial Ideals
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that th...
متن کاملDecomposition of ideals into pseudo-irreducible ideals in amalgamated algebra along an ideal
Let $f : A rightarrow B$ be a ring homomorphism and $J$ an ideal of $B$. In this paper, we give a necessary and sufficient condition for the amalgamated algebra along an ideal $Abowtie^fJ$ to be $J$-Noetherian. Then we give a characterization for pseudo-irreducible ideals of $Abowtie^fJ$, in special cases.
متن کاملWeakly irreducible ideals
Let $R$ be a commutative ring. The purpose of this article is to introduce a new class of ideals of R called weakly irreducible ideals. This class could be a generalization of the families quasi-primary ideals and strongly irreducible ideals. The relationships between the notions primary, quasi-primary, weakly irreducible, strongly irreducible and irreducible ideals, in different rings, has bee...
متن کاملThe Slice Algorithm for irreducible decomposition of monomial ideals
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Compositio Mathematica
سال: 2016
ISSN: 0010-437X,1570-5846
DOI: 10.1112/s0010437x16007272